AWPP 2008 Report Technical Tour
نویسندگان
چکیده
منابع مشابه
Technical Report TR - 2008 - 021 Rainbow Paths
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-coloring of the edges of Kn in which one may find, between any pair of vertices, a large number of internally disjoint krainbow paths. In fact, our construction obtains the largest possible number of paths. This problem was...
متن کاملTechnical Report 2008 - 002 Operational Semantics for a Concurrent
We investigate the possibility of constructing a fully compositional concurrent process algebra (dubbed Communicating Visibly pushdown Processes or CVP for short) based on visibly pushdown automata. CVP is a superset of CSP, thus combining all the good properties of finite-state algebrae with context-free features. In particular, CVP includes support for parallel composition (which has however ...
متن کاملTechnical Report #2008-08: Tapered empirical likelihood for time series
We investigate data tapering in two formulations of empirical likelihood for time series. One empirical likelihood is formed from tapered data-blocks in the time-domain and a second is based on the tapered periodogram in the frequency-domain. Limiting distributions are provided for both empirical likelihood versions under tapering. Theoretical and simulation evidence indicate that a data taper ...
متن کاملGMD Technical Report # 1077 Recent Developments in Japanese Robotics Research – Notes of a Japan Tour –
Robotics appears to be a very lively and fruitful field of research in Japan. Some of the research topics cannot be found elsewhere at all, and some are significantly advanced. Discussing this impression, a collection of laboratories is introduced with their most outstanding topics. Moreover some background information about research plans, politics, and organisations are given. This report is ...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Round-Tour Voronoi Diagrams
This paper proposes a new generalization of the Voronoi diagram. Suppose that restaurants and bookstores are located in a city, and we want to visit both a restaurant and bookstore and return to our house. To each pair of a restaurant and a bookstore, we can assign a region such that a resident in this region can visit the restaurant and bookstore in a round tour that is shorter than that for a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Seikei-Kakou
سال: 2008
ISSN: 0915-4027,1883-7417
DOI: 10.4325/seikeikakou.21.24